skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Berger, Eli"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, European Journal of Combinatorics)
    Sivaraman (2020) conjectured that if G is a graph with no induced even cycle then there exist sets X1,X2⊆V(G) satisfying V(G)=X1∪X2 such that the induced graphs G[X1] and G[X2] are both chordal. We prove this conjecture in the special case where G contains no sector wheel, namely, a pair (H,w) where H is an induced cycle of G and w is a vertex in V(G)∖V(H) such that N(w)∩H is either V(H) or a path with at least three vertices. 
    more » « less
    Free, publicly-accessible full text available December 1, 2025
  2. ; (, Combinatorica)
    Full Text Available 
  3. ; ; ; (, European Journal of Combinatorics)
    Full Text Available 
  4. ; ; (, Discrete Mathematics)
    null (Ed.)
    Full Text Available